Boundary-influenced robust controls: two network examples
نویسندگان
چکیده
منابع مشابه
Boundary - Influenced Robust Controls : Two Network Examples ∗
We consider the differential game associated with robust control of a system in a compact state domain, using Skorokhod dynamics on the boundary. A specific class of problems motivated by queueing network control is considered. A constructive approach to the Hamilton-Jacobi-Isaacs equation is developed which is based on an appropriate family of extremals, including boundary extremals for which ...
متن کاملRobust Controls for Network Revenue Management
R management models traditionally assume that future demand is unknown but can be described by a stochastic process or a probability distribution. Demand is, however, often difficult to characterize, especially in new or nonstationary markets. In this paper, we develop robust formulations for the capacity allocation problem in revenue management using the maximin and the minimax regret criteria...
متن کاملTowards Deep Neural Network Architectures Robust to Adversarial Examples
Recent work has shown deep neural networks (DNNs) to be highly susceptible to well-designed, small perturbations at the input layer, or so-called adversarial examples. Taking images as an example, such distortions are often imperceptible, but can result in 100% mis-classification for a state of the art DNN. We study the structure of adversarial examples and explore network topology, pre-process...
متن کاملSynthesizing Robust Adversarial Examples
Neural network-based classifiers parallel or exceed human-level accuracy on many common tasks and are used in practical systems. Yet, neural networks are susceptible to adversarial examples, carefully perturbed inputs that cause networks to misbehave in arbitrarily chosen ways. When generated with standard methods, these examples do not consistently fool a classifier in the physical world due t...
متن کاملOnline Companion for Robust Controls for Network Revenue Management
Proof of Proposition 1. With a slight abuse of notation, let us denote by D d the set of multivariate stochastic processes such that the aggregate demand equals d. Accordingly, Problem (5) can be decomposed as follows: ρ(y) = max d∈P max D∈D d max z∈F R(z, D) − R(y, D) = max d∈P max z∈F max D∈D d R(z, D) + max D∈D d −R(y, D). Let ξ j be the realized sales under a booking policy z when the deman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2006
ISSN: 1292-8119,1262-3377
DOI: 10.1051/cocv:2006016